Filtering Left Dislocation Chains in Parsing Categorial Grammar 1 Parsing Left Dislocation
نویسندگان
چکیده
This paper reports on a way to reduce the complexity of the process of left dislocation (re)construction for categorial grammar in the case of lexically assigned gaps, as an additional restriction on the complexity arising from lexical polymorphism in general. Specifying extraction sites lexically has the advantage that the combinatory explosion can be contained in the preparsing track by a specialized constraint on the expansion of sequences of categories. This constraint is called the Left Dislocation Chain Filter and is implemented by a Finite State Transducer. It is shown that the Filter can reduce the number of full string assignments under consideration prior to parsing with an average of one half to one order of magnitude, depending on the nature of the sentence. Left dislocation is a very common, almost universal phenomenon in natural languages. It establishes the relation between an element at the left periphery of a clause and a particular, lexically open position in its right context. The leftward nature of dislocation is explained in Kayne (1994). The most prominent of these relations are invoked by so called wh-elements at the leftmost edge of questions and relative clauses. If a language has left dislocation, however, many other constituents can occur in a left dislocated position. Here are some examples from Dutch; the distinguished position in the right context is marked by t. (1) Mimi vroeg zich af wie] Jan dacht dat t zou gaan winnen Mimi wondered (herself) who Jan thought that would go win`Mimi wondered who Jan thought would win' (2) De lm die] ik heb t gezien] kan jij niet t gezien hebben The movie that I have seen can you not seen havèYou cannot have seen the movie I have seen'
منابع مشابه
Parsing for Semidirectional Lambek Grammar is NP-Complete
We study the computational complexity of the parsing problem of a variant of Lambek Categorial Grammar that we call semidirectional. In semidirectional Lambek calculus SDL there is an additional nondirectional abstraction rule allowing the formula abstracted over to appear anywhere in the premise sequent’s left-hand side, thus permitting non-peripheral extraction. SDL grammars are able to gener...
متن کاملA Supertag-Context Model for Weakly-Supervised CCG Parser Learning
Combinatory Categorial Grammar (CCG) is a lexicalized grammar formalism in which words are associated with categories that specify the syntactic configurations in which they may occur. We present a novel parsing model with the capacity to capture the associative adjacent-category relationships intrinsic to CCG by parameterizing the relationships between each constituent label and the pretermina...
متن کاملBipolar Dislocation of Left Shoulder and Left Elbow: (Luxatio Erecta+Posterior Dislocation of Elbow) (A Case Report)
This is a report on simultaneous dislocation of the left shoulder and elbow resulting in a 16 years old boy. Bipolar dislocation of Luxatio Erecta and posterior dislocation of the elbow is extremely rare. After clinical examinations (attention to pain, swelling, and deformity of the shoulder and elbow joints and neurovascular examinations), the necessary radiography was performed for the patien...
متن کاملLambek Calculus and Formal Grammars
The question about the position of categorial grammars in the Chomsky hierarchy arose in late 1950s and early 1960s. In 1960 Bar-Hillel, Gaifman, and Shamir [1] proved that a formal language can be generated by some basic categorial grammar if and only if the language is context-free. They conjectured (see also [7]) that the same holds for Lambek grammars, i. e., for categorial grammars based o...
متن کاملcient Normal - Form Parsing for Combinatory Categorial Grammar
Under categorial grammars that have powerful rules like composition, a simple n-word sentence can have exponentially many parses. Generating all parses is ine cient and obscures whatever true semantic ambiguities are in the input. This paper addresses the problem for a fairly general form of Combinatory Categorial Grammar, by means of an e cient, correct, and easy to implement normal-form parsi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996